Reducibility of Polynomials
ثبت نشده
چکیده
Reducibility without qualification means in this lecture reducibility over the rational field. Questions on such reducibility occupy an intermediate place between questions on reducibility of polynomials over an algebraically closed field and those on primality. I shall refer to these two cases as to the algebraic and the arithmetic one and I shall try to exhibit some of the analogies considering several irreducibility theorems as'opposed to numerous irreducibility criteria (cf. [34], p. 140) usually without analogues.
منابع مشابه
On the reducibility of some composite polynomials over finite fields
Let Fq be a Galois field with q = p elements of characteristic p, and Fq is multiplicative group of Fq. The problem of irreducibility of polynomials and determining the reducibility of a given polynomial stems both from mathematical theory and applications. At mathematical aspects determining the reducibility of a polynomial often appears in number theory, combinatorics and algebraic geometries...
متن کاملFactorization of Quadratic Polynomials in the Ring of Formal Power Series over Z
We establish necessary and sufficient conditions for a quadratic polynomial to be irre-ducible in the ring Z[[x]] of formal power series over the integers. In particular, for polynomials of the form p n + p m βx + αx 2 with n, m ≥ 1 and p prime, we show that reducibility in Z[[x]] is equivalent to reducibility in Zp[x], the ring of polynomials over the p-adic integers.
متن کاملIrreducible Polynomials of Maximum Weight
We establish some necessary conditions for the existence of irreducible polynomials of degree n and weight n over F2. Such polynomials can be used to efficiently implement multiplication in F2n . We also provide a simple proof of a result of Bluher concerning the reducibility of a certain family of polynomials.
متن کاملSelf-correcting polynomial programs
The theory of self-testing/correcting programs by random self-reducibility (RSR) [1, 2, 5] is a novel and powerful tool to approach the problem of program correction. It allows real-time testing and correcting of programs. Moreover, it allows the simultaneous checking of the hardware and software without requiring any knowledge of the implementation of a program. Basically, a function is random...
متن کاملNewman Polynomials, Reducibility, and Roots on the Unit Circle
A length k Newman polynomial is any polynomial of the form za1 + · · ·+zak (where a1 < · · · < ak). Some Newman polynomials are reducible over the rationals, and some are not. Some Newman polynomials have roots on the unit circle, and some do not. Defining, in a natural way, what we mean by the “proportion” of length k Newman polynomials with a given property, we prove that • 1/4 of length 3 Ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010